The Treewidth of MDS and Reed-Muller Codes
نویسندگان
چکیده
The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we prove the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity) of any of its trellis realizations. From this, we obtain exact expressions for the treewidth of these codes, which constitute the only known explicit expressions for the treewidth of algebraic codes.
منابع مشابه
A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS∗
In this paper, we introduce a lower bound for the generalized Hamming weights, which is applicable to arbitrary linear code, in terms of the notion of well-behaving. We also show that any [n, k] linear code C over a finite field F is the t-th rank MDS for t such that g(C) + 1 ≤ t ≤ k where g(C) is easily calculated from the basis of F so chosen that whose first n − k elements generate C⊥. Final...
متن کاملIntersection of Isomorphic Linear Codes
Given an (n, k) linear code C over GF(q), the intersection of C with a code ?(C), where ? # Sn , is an (n, k1) code, where max[0, 2k&n] k1 k. The intersection problem is to determine which integers in this range are attainable for a given code C. We show that, depending on the structure of the generator matrix of the code, some of the values in this range are attainable. As a consequence we giv...
متن کاملAnother Generalization of the Reed-Muller Codes
The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized ReedMuller code over GF(q) in the literature. The major objective of this paper is to present another generalization of the punctured binary Reed-Muller code. Another objective is to construct a family of reversible cyclic codes that are related to the newly generalized Reed-Muller codes. Index Te...
متن کاملGalois geometries and coding theory
Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even fu...
متن کاملOn the third weight of generalized Reed-Muller codes
In this paper, we study the third weight of generalized Reed-Muller codes. Using results from [6], we prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Re...
متن کامل